Protecting a graph with mobile guards
نویسندگان
چکیده
منابع مشابه
Protecting Software Code by Guards
Protection of software code against illegitimate modifications by its users is a pressing issue to many software developers. Many software-based mechanisms for protecting program code are too weak (e.g., they have single points of failure) or too expensive to apply (e.g., they incur heavy runtime performance penalty to the protected programs). In this paper, we present and explore a methodology...
متن کاملMobile vs. point guards
We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using “rectangular vision”. We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Further...
متن کاملNucleoredoxin guards against oxidative stress by protecting antioxidant enzymes.
Cellular accumulation of reactive oxygen species (ROS) is associated with a wide range of developmental and stress responses. Although cells have evolved to use ROS as signaling molecules, their chemically reactive nature also poses a threat. Antioxidant systems are required to detoxify ROS and prevent cellular damage, but little is known about how these systems manage to function in hostile, R...
متن کاملPROTECTING MOVING TARGETS WITH MULTIPLE MOBILE RESOURCES Protecting Moving Targets with Multiple Mobile Resources
In recent years, Stackelberg Security Games have been successfully applied to solve resource allocation and scheduling problems in several security domains. However, previous work has mostly assumed that the targets are stationary relative to the defender and the attacker, leading to discrete game models with finite numbers of pure strategies. This paper in contrast focuses on protecting mobile...
متن کاملHidden Mobile Guards in Simple Polygons
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most other art gallery problems, existence is the primary question: does a specific type of polygon admit some guard set? Types include simple polygons and the subclasses of orthogonal, monotone, and starshaped polygons. Add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2016
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm151109021k